Data Complexity of Query Answering in Expressive Description Logics via Tableaux
نویسندگان
چکیده
منابع مشابه
The Complexity of Conjunctive Query Answering in Expressive Description Logics
Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing open problem. We determine the complexity of conjunctive query answering in expressive DLs between ALC and SHIQ, and thus settle the problem. In a nutshell, we show that conjunctive query answering is 2ExpTime-complete in the pre...
متن کاملData Complexity of Query Answering in Expressive Description Logics with Nominals
The formal foundations of the standard web ontology languages, OWL-Lite and OWLDL, are provided by expressive Description Logics (DLs), such as SHIF and SHOIQ. In the Semantic Web and other domains, ontologies are increasingly seen also as a mechanism to access and query data repositories. This novel context poses an original combination of challenges that has not been addressed before: (i) suf...
متن کاملData Complexity of Query Answering in Description Logics (Extended Abstract)
We study the data complexity of answering conjunctive queries over Description Logic knowledge bases constituted by a TBox and an ABox. In particular, we are interested in characterizing the FOrewritability and the polynomial tractability boundaries of conjunctive query answering, depending on the expressive power of the DL used to express the knowledge base. What emerges from our complexity an...
متن کاملData Complexity of Query Answering in Description Logics
In this paper we study data complexity of answering conjunctive queries over DL knowledge bases constituted by an ABox and a TBox. In particular, we characterize the LogSpace boundary (over the data) of the problem. This boundary is particularly meaningful because, when we go above it, query answering is not expressible as a first-order logic formula (and hence an SQL query) over the data. With...
متن کاملNon-Uniform Data Complexity of Query Answering in Description Logics
In ontology-based data access (OBDA), ontologies are used as an interface for querying instance data. Since in typical applications the size of the data is much larger than the size of the ontology and query, data complexity is the most important complexity measure. In this paper, we propose a new method for investigating data complexity in OBDA: instead of classifying whole logics according to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2008
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-008-9102-9